Multiplicative Character Sums with the Sum of g-ary Digits Function
نویسندگان
چکیده
We establish upper bounds for multiplicative character sums with the function σg(n) which computes the sum of the digits of n in a fixed base g ≥ 2. Our results may be viewed as analogues of some previously known results for exponential sums with sum of g-ary digits function. MSC Numbers: 11L40, 11A63.
منابع مشابه
The ratio and product of the multiplicative Zagreb indices
The first multiplicative Zagreb index $Pi_1(G)$ is equal to the product of squares of the degree of the vertices and the second multiplicative Zagreb index $Pi_2(G)$ is equal to the product of the products of the degree of pairs of adjacent vertices of the underlying molecular graphs $G$. Also, the multiplicative sum Zagreb index $Pi_3(G)$ is equal to the product of the sum...
متن کاملPrimes with an Average Sum of Digits
The main goal of this paper is to provide asymptotic expansions for the numbers #{p 6 x : p prime, sq(p) = k} for k close to ((q − 1)/2) logq x, where sq(n) denotes the q-ary sum-of-digits function. The proof is based on a thorough analysis of exponential sums of the form ∑ p6x e(αsq(p)) (the sum is restricted to p prime), where we have to extend a recent result by the second two authors.
متن کاملOn trees and the multiplicative sum Zagreb index
For a graph $G$ with edge set $E(G)$, the multiplicative sum Zagreb index of $G$ is defined as$Pi^*(G)=Pi_{uvin E(G)}[d_G(u)+d_G(v)]$, where $d_G(v)$ is the degree of vertex $v$ in $G$.In this paper, we first introduce some graph transformations that decreasethis index. In application, we identify the fourteen class of trees, with the first through fourteenth smallest multiplicative sum Zagreb ...
متن کاملBilinear Character Sums and Sum–product Problems on Elliptic Curves
Let E be an ordinary elliptic curve over a finite field Fq of q elements. We improve a bound on bilinear additive character sums over points on E, and obtain its analogue for bilinear multiplicative character sums. We apply these bounds to some variants of the sum–product problem on E.
متن کاملEstimates for Nonsingular Mixed Character Sums
a nontrivial multiplicative character of k. We extend χ to k by defining χ(0) = 0. We wish to consider character sums over An, n ≥ 1, of the following form. We are given a polynomial f (x) := f (x1, . . . , xn) in k[x1, . . . ,Xn] of degree d ≥ 1, and we are given a second polynomial g(X) := g(x1, . . . , xn) in k[x1, . . . , xn] of degree e ≥ 1. We are interested in understanding when the sum ...
متن کامل